Queues with Nonexponential Failure Times

نویسندگان

  • Timothy I. Matis
  • Richard M. Feldman
  • Guy L. Curry
چکیده

There are two difficulties with the inclusion of nonexponential failure times in queueing models. The first effect is that the failures will change the mean and variance (as well as higher moments) of the effective service times. The second difficulty is less obvious in that nonexponential failures will eliminate the stochastic independence between successive service times. Using phase-type distributions to model failure and repair times, it is relatively simple to model an M/M/1 queueing systems with failures; however, the “curse of dimensionality" takes over for G/G/1 systems with failures. Therefore, we propose in this paper to use an M/M/1 model with server failures as the basis for an approximation to more general systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Bounds for Perturbing Nonexponential Queues

A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in singleand multi-server queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N , M/G/c/N , and GI/M/c/N . First, for the standard GI/G/1/N queue, it is illustrated ho...

متن کامل

SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.

This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt

متن کامل

A Framework for Task Reallocation in Distributed Computing Systems with Non-Markovian Communication Delays

This paper presents a general framework for optimal task reallocation in heterogeneous distributed computing systems (DCSs). The framework relies on a rigorous analytical model for the stochastic execution time of a workload. The model takes into account the heterogeneity and randomness of both service times and communication delays, an arbitrary task-reallocation policy as well as the stochast...

متن کامل

A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues

We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing (PS) and feedback (FB) queues under an M/GI/1 system. We show that FB outperforms PS under service distributions having decreasing failure rates; whereas PS outperforms FB under service distributions having increasing failure rates. c © 2003 Elsevier B.V. All rights reserved.

متن کامل

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006